Self-Witnessing Polynomial-Time Complexity and Prime Factorization
نویسندگان
چکیده
For a number of computational search problems the existence of a polynomial time algorithm for the problem implies that a polynomial time algorithm for the problem is constructively known Some instances of such self witnessing polynomial time complexity are presented Our main result demonstrates this property for the problem of computing the prime factorization of a positive integer based on a lemma which shows that a certi cate for primality or compositeness can be constructed for a positive integer p in deterministic polynomial time given a complete factorization of p
منابع مشابه
Linear Time Solution to Prime Factorization by Tissue P Systems with Cell Division
Prime factorization is useful and crucial for public-key cryptography, and its application in public-key cryptography is possible only because prime factorization has been presumed to be difficult. A polynomial-time algorithm for prime factorization on a quantum computer was given by P. W. Shor in 1997. In this work, it is considered as a function problem, and in the framework of tissue P syste...
متن کاملThe Number Field Sieve
One of the most important and widely-studied questions in computational number theory is how to efficiently compute the prime factorizations of large integers. Among other applications, fast prime-factorization algorithms would break the widely-used RSA cryptosystem, and be of great interest in complexity theory. In particular, there is no algorithm which can factor an integer n in polynomial t...
متن کاملSums of Divisors, Perfect Numbers and Factoring
Let N be a positive integer, and let denote the sum of the divisors of N = 1+2+3+6 = 12). We show computing is equivalent to factoring N in the following sense: there is a random polynomial time algorithm that, given N),produces the prime factorization of N, and N) can be computed in polynomial time given the factorization of N. We show that the same result holds for the sum of the kth powers o...
متن کاملA New Sibling of BQP
We present a new quantum complexity class, called MQ, which is contained in AWPP. This class has a compact and simple mathematical definition, involving only polynomial-time computable functions and a unitarity condition. It contains both Deutsch-Jozsa’s and Shor’s algorithm, while its relation to BQP is unknown. This shows that in the complexity class hierarchy, BQP is not an extraordinary iso...
متن کاملFinding Primitive Roots Pseudo-Deterministically
Pseudo-deterministic algorithms are randomized search algorithms which output unique solutions (i.e., with high probability they output the same solution on each execution). We present a pseudo-deterministic algorithm that, given a prime p, finds a primitive root modulo p in time exp(O( p log p log log p)). This improves upon the previous best known provable deterministic (and pseudo-determinis...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Des. Codes Cryptography
دوره 2 شماره
صفحات -
تاریخ انتشار 1992